Adaptive-multilevel BDDC algorithm for three-dimensional plane wave Helmholtz systems
نویسندگان
چکیده
In this paper, we are concerned with the weighted plane wave least-squares (PWLS) method for three-dimensional Helmholtz equations, and develop multi-level adaptive BDDC algorithms solving resulting discrete system. order to form coarse components, local generalized eigenvalue problems each common face edge carefully designed. The condition number of two-level preconditioned system is proved be bounded above by a user-defined tolerance constant which dependent on maximum faces edges per subdomain subdomains sharing edge. efficiency these illustrated benchmark problem. numerical results show robustness our respect number, mesh size, illustrate that algorithm can reduce scale problem used solve large efficiently.
منابع مشابه
Adaptive BDDC in three dimensions
The adaptive BDDC method is extended to the selection of face constraints in three dimensions. A new implementation of the BDDC method is presented based on a global formulation without an explicit coarse problem, with massive parallelism provided by a multifrontal solver. Constraints are implemented by a projection and sparsity of the projected operator is preserved by a generalized change of ...
متن کاملParallel Preconditioners for Plane Wave Helmholtz and Maxwell Systems with Large Wave Numbers
A kind of non-overlapping domain decomposition preconditioner was proposed to solve the systems generated by the plane wave least-squares (PWLS) method for discretization of Helmholtz equation and Maxwell equations respectively in [13] and [14]. In this paper we introduce overlapping variants of this kind of preconditioner and give some comparison among these domain decomposition preconditioner...
متن کاملA Three-Level BDDC Algorithm for Mortar Discretizations
In this talk, three-level BDDC algorithms will be presented for the solutions of large sparse linear algebraic systems arising from the mortar discretization of elliptic boundary value problems. The mortar discretization is considered on geometrically non-conforming subdomain partitions. In the algorithms, the large coarse problems from two-level BDDC algorithms are solved approximately while a...
متن کاملA three-level BDDC algorithm for a saddle point problem
Abstract BDDCalgorithms have previously been extended to the saddle point problems arising frommixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC algorithms, all iterates are required to be in a benign space, a subspace in which the preconditioned operators are positive definite. This requirement can lead to large coarse problems, which have to be generat...
متن کاملA Three-level Bddc Algorithm for Saddle Point Problems
BDDC algorithms have previously been extended to the saddle point problems arising from mixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC algorithms, all iterates are required to be in a benign space, a subspace in which the preconditioned operators are positive definite. This requirement can lead to large coarse problems, which have to be generated and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2021
ISSN: ['0377-0427', '1879-1778', '0771-050X']
DOI: https://doi.org/10.1016/j.cam.2020.113011